Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications

نویسندگان

چکیده

Specifications considered in symbolic control are often interpreted qualitatively and controllers usually classified as correct if they enforce the specification or incorrect do not. In practice, a given ideal might be impossible to meet. that case, it is interesting for system designer able quantify distance between achievable behaviors specification, synthesize least-violating controller enforcing closed-loop behavior closest one. this paper, we develop such an approach three types of specifications: safety, uniform reachability attractivity. We define controllability measures associated these properties. For finite transition systems, present dynamic programming algorithms computation controllers. discuss how results can used infinite systems via techniques. To demonstrate relevance our approach, show application adaptive cruise control.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic controller synthesis for LTL specifications

It is an old dream in computer science to automatically generate a system from a formal specification or at least to automatically check whether a system is guaranteed to satisfy a specification. The second problem is known as the verification problem and powerful tools exist that automatically check the correctness of a system with respect to a given declarative specification. In this thesis w...

متن کامل

Controller Synthesis for Safety and Reachability via Approximate Bisimulation

In this paper, we consider the problem of controller design using approximately bisimilar abstractions with an emphasis on safety and reachability specifications. We propose abstraction-based approaches to solve both classes of problems. We start by synthesizing a controller for an approximately bisimilar abstraction. Then, using a concretization procedure, we obtain a controller for our initia...

متن کامل

Controller Synthesis for MTL Specifications

We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL with timing constraints on modalities, and recently, its model-checking has been proved decidable in several cases. We investigate these decidable fragments of MTL (full MTL when interpreted over finite timed words, and Safety-MTL...

متن کامل

Mode Switching Synthesis for Reachability Specifications

In many control applications, a specific set of output tracking controllers of satisfactory performance have already been designed and must be used. When such a collection of control modes is available, an important problem is to be able to accomplish a variety of high level tasks by appropriately switching between the low-level control modes. In this paper, we define a concept of control modes...

متن کامل

Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata

In this paper we consider the problem of computing the optimal (minimum or maximum) expected time to reach a target and the synthesis of an optimal controller for a probabilistic timed automaton (PTA). Although this problem admits solutions that employ the digital clocks abstraction or statistical model checking, symbolic methods based on zones and priced zones fail due to the difficulty of inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2021

ISSN: ['1873-2836', '0005-1098']

DOI: https://doi.org/10.1016/j.automatica.2021.109543